Event Matching Using the Transitive Closure of Dependency Relations
نویسندگان
چکیده
This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملClassifying Temporal Relations with Simple Features
Approaching temporal link labelling as a classification task has already been explored in several works. However, choosing the right feature vectors to build the classification model is still an open issue, especially for event-event classification, whose accuracy is still under 50%. We find that using a simple feature set results in a better performance than using more sophisticated features b...
متن کاملThe Minimal Dependency Relation for Causal Event Ordering in Distributed Computing
Several algorithms of different domains in distributed systems are designed over the principle of the Happened-Before Relation (HBR). One common aspect among them is that they intend to be efficient in their implementation by identifying and ensuring the necessary and sufficient dependency constraints. In this pursuit, some previous works talk about the use of a transitive reduction of the caus...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملMovement Rules Revisited
The Praguian approach to formal description of language (in detail, see Sgall et aI. 1986), works with dependency syntax and includes the topicfocus articulation into the (underlying, tectogrammatical) syntactic representations of sentences, using the left-to-right order of the nodes of the dependency tree for that purpose. The edges of the tree denote the dependency relations and the nodes car...
متن کامل